Subspaces Clustering Approach to Lossy Image Compression
نویسندگان
چکیده
In this contribution lossy image compression based on subspaces clustering is considered. Given a PCA factorization of each cluster into subspaces and a maximal compression error, we show that the selection of those subspaces that provide the optimal lossy image compression is equivalent to the 0-1 Knapsack Problem. We present a theoretical and an experimental comparison between accurate and approximate algorithms for solving the 0-1 Knapsack problem in the case of lossy image compression.
منابع مشابه
ON A LOSSY IMAGE COMPRESSION/RECONSTRUCTION METHOD BASED ON FUZZY RELATIONAL EQUATIONS
The pioneer work of image compression/reconstruction based onfuzzy relational equations (ICF) and the related works are introduced. TheICF regards an original image as a fuzzy relation by embedding the brightnesslevel into [0,1]. The compression/reconstruction of ICF correspond to thecomposition/solving inverse problem formulated on fuzzy relational equations.Optimizations of ICF can be consequ...
متن کاملUnsupervised segmentation of natural images via lossy data compression
In this paper, we cast natural-image segmentation as a problem of clustering texture features as multivariate mixed data. We model the distribution of the texture features using a mixture of Gaussian distributions. Unlike most existing clustering methods, we allow the mixture components to be degenerate or nearly-degenerate. We contend that this assumption is particularly important for mid-leve...
متن کاملفشردهسازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر
Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...
متن کاملA Study of Clustering Algorithms and Validity for Lossy Image Set Compression
A hierarchical lossy image set compression algorithm (HMSTa) has recently been proposed for lossy compression of image sets. It was shown that this algorithm performs well when an image set contains well separated clusters of similar images. As a result, if one applies the HMSTa algorithm after a clustering algorithm has been applied, the compression performance depends on the quality of the pa...
متن کاملSubspace-Clustering-Based Multispectral Image Compression
This paper describes a subspace clustering strategy for the spectral compression of multispectral images. Unlike standard PCA, this approach finds clusters in different subspaces of different dimension. Consequently, instead of representing all spectra in a single low-dimensional subspace of a fixed dimension, spectral data are assigned to multiple subspaces having a range of dimensions from on...
متن کامل